منابع مشابه
Scalable Flat-Combining Based Synchronous Queues
In a synchronous queue, producers and consumers handshake to exchange data. Recently, new scalable unfair synchronous queues were added to the Java JDK 6.0 to support high performance thread pools. This paper applies flat-combining to the problem of designing a synchronous queue algorithm. We first use the original flat-combining algorithm, a single “combiner” thread acquires a global lock and ...
متن کاملFast and Scalable k-FIFO Queues
We introduce fast and scalable algorithms that implement boundedand unbounded-size, lock-free, linearizable k-FIFO queues with empty (and full) check. Logically, a k-FIFO queue can be understood as queue where each element may be dequeued out-of-order up to k− 1 or as pool where each element is dequeued within a k-bounded number of dequeue operations. We show experimentally that there exist opt...
متن کاملVerification of Scalable Synchronous Queue
Lock-free algorithms are extremely hard to be built correct due to their fine-grained concurrency natures. Formal techniques for verifying them are crucial. We present a framework for verification of CAS-based lock-free algorithms, and prove a nontrivial lock-free algorithm Scalable Synchronous Queue that is practically adopted in Java 6. The strength of our approach lies on that it relieves th...
متن کاملScalable 3D Visualization via Synchronous Data Hiding
The principal objective of this thesis is to unify disparate 3D in-formation and then realize scalable visualization in a client/server environmentthat is heterogeneous in terms of network, computing and memory resources. Forscalability we are exploiting the multiresolution nature of the discrete wavelettransform (DWT) from the state of the art JPEG2000 codec. The data unificati...
متن کاملFast and Scalable, Lock-Free k-FIFO Queues
We introduce fast and scalable algorithms that implement boundedand unbounded-size lock-free k-FIFO queues on parallel, shared memory hardware. Logically, a k-FIFO queue can be understood as queue where elements may be dequeued out-of-order up to k 1, or as pool where the oldest element is dequeued within at most k dequeue operations. The presented algorithms enable up to k enqueue and k dequeu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 2009
ISSN: 0001-0782,1557-7317
DOI: 10.1145/1506409.1506431